RSA Problem
نویسندگان
چکیده
منابع مشابه
A Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing
[1] Corresponding author e-mail: [email protected] [1] Corresponding author e-mail: [email protected] Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...
متن کاملAssociation between MTHFR 1298A>C Polymorphism with RSA and IVF Failure
Abstract Background Polymorphism A1298C of the methylenetetrahydrofolate-reductase (MTHFR) gene has been implicated in spontaneous abortion. In this study, we determined the allele and genotype frequencies of this polymorphism in recurrent spontaneous abortion (RSA) and implantation failure after in vitro fertilization (IVF). Materials and Methods We performed a case–control study on 60 wom...
متن کاملHD{RSA: Hybrid Dependent RSA a New Public-Key Encryption Scheme
This paper describes a new hybrid RSA-based public-key encryption scheme, the HD-RSA. It relies on the recently proposed Dependent{RSA problem, which can be proven as di cult as the original RSA problem, in some circumstances. The basic scheme, using the \one-time pad" symmetric encryption, provides a both very e cient scheme and secure relative to the sole Dependent{RSA problem. A more general...
متن کاملSubmission to IEEE P 1363 aHD { RSA : Hybrid Dependent RSAa New Public - Key Encryption
This paper describes a new hybrid RSA-based public-key encryption scheme, the HD-RSA. It relies on the recently proposed Dependent{RSA problem, which can be proven as diicult as the original RSA problem, in some circumstances. The basic scheme, using the \one-time pad" symmetric encryption, provides a both very eecient scheme and secure relative to the sole Dependent{RSA problem. A more general...
متن کاملOn the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides some evidence towards the validity of this equivalence. We show that any e cient generic ring algorithm which solves the ( exible) low-exponent RSA problem can be converted into an e cient factoring algorithm. Thus, the low-expo...
متن کاملWhat Hashes Make RSA-OAEP Secure?
Firstly, we demonstrate a pathological hash function choice that makes RSA-OAEP insecure. This shows that at least some security property is necessary for the hash functions used in RSAOAEP. Nevertheless, we conjecture that only some very minimal security properties of the hash functions are actually necessary for the security of RSA-OAEP. Secondly, we consider certain types of reductions that ...
متن کامل